<HTML><HEAD><TITLE>alldifferent(+L)</TITLE>
</HEAD><BODY>[ <A HREF="index.html">library(ic_global_gac)</A> | <A HREF="../../index.html">Reference Manual</A> | <A HREF="../../fullindex.html">Alphabetic Index</A> ]
<H1>alldifferent(+L)</H1>
GAC version of alldifferent
<DL>
<DT><EM>L</EM></DT>
<DD>List of integers or domain variables, or a collection a la collection_to_list/2
</DD>
</DL>
<H2>Description</H2>
This predicate implements a GAC (generalized arc consistency) version of the alldifferent constraint. It uses the classical bitpartite matching implementation using the graph_algorithms library. This version often removes more values than the bound consistent alldifferent in the ic_global library, or the forward checking variant in the ic library, but may spend much more time doing this.
<H3>Fail Conditions</H3>
fails if there is no bipartite matching between all variables and the possible values
<H2>See Also</H2>
<A HREF="../../lib_public/ic_global_gac/matching-2.html">matching / 2</A>, <A HREF="../../lib/ic/alldifferent-1.html">ic : alldifferent / 1</A>, <A HREF="../../lib/ic_global/alldifferent-1.html">ic_global : alldifferent / 1</A>
</BODY></HTML>
